翻訳と辞書 Words near each other ・ Circular Quay ferry wharf ・ Circular Quay railway station ・ Circular rampart ・ Circular rampart of Burg ・ Circular reasoning ・ Circular reference ・ Circular reporting ・ Circular RNA ・ Circular RNA (circRNA) databases and resources ・ Circular saw ・ Circular sector ・ Circular segment ・ Circular shift ・ Circuit Media ・ Circuit Merit ・ Circuit minimization for Boolean functions ・ Circuit Mont-Tremblant ・ Circuit no Ōkami ・ Circuit noise level ・ Circuit of culture ・ Circuit of Ireland Rally ・ Circuit of the Americas ・ Circuit of Wales ・ Circuit Park Zandvoort ・ Circuit party ・ Circuit Paul Armagnac ・ Circuit Planete ・ Circuit preacher ・ Circuit quantum electrodynamics ・ Circuit rank Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Circuit minimization for Boolean functions ： ウィキペディア英語版 Circuit minimization for Boolean functions In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The unbounded circuit minimization problem was long-conjectured to be $\backslash Sigma\_2^P$-complete, a result finally proved in 2008,〔 This is an extended version of the conference paper 〕 but there are effective heuristics such as Karnaugh maps and the Quine–McCluskey algorithm that facilitate the process. ==Purpose== The problem with having a complicated circuit (i.e. one with many elements, such as logical gates) is that each element takes up physical space in its implementation and costs time and money to produce in itself. Circuit minimization may be one form of logic optimization used to reduce the area of complex logic in integrated circuits. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Circuit minimization for Boolean functions」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.